Adjunction semigroups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exotic structures and adjunction inequality

Theorem 1.1. ([E]) Let X = B ∪ (1-handles) ∪ (2-handles) be four-dimensional handlebody with one 0-handle and no 3or 4-handles. Then • The standard symplectic structure on B can be extended over 1-handles so that manifold X1 = B 4 ∪ (1-handles) is a compact Stein domain. • If each 2-handle is attached to ∂X1 along a Legendrian knot with framing one less then Thurston-Bennequin framing of this k...

متن کامل

Quantifier elimination via adjunction

Sufficient conditions are provided for quantifier elimination to hold in a first-order theory. The conditions have two main purposes: (1) to ensure that satisfaction of existential formulas is reflected by an embedding; and (2) to guarantee the existence of a “minimal" model of the theory extending a model of the universal formulas entailed by the theory. The first goal is obtained by requiring...

متن کامل

Is Adjunction Compositional?

The idea of adjunction can be traced back to the beginnings of generative syntax. Already Zellig Harris used adjunction and in [Harris, 1979] even exposes the idea that sentence meanings can be derived from kernel sentences via adjunction. Today, TAGs and the somewhat lesser known contextual grammars ([Marcus, 1967]) still use adjunction as a major syntactic operation. Recently, [Kallmeyer and ...

متن کامل

Injective Spaces via Adjunction

Our work over the past years shows that not only the collection of (for instance) all topological spaces gives rise to a category, but also each topological space can be seen individually as a category by interpreting the convergence relation x −→ x between ultrafilters and points of a topological space X as arrows in X. Naturally, this point of view opens the door to the use of concepts and id...

متن کامل

The Timing of Adjunction

This paper proposes a combinatory algorithm of structure building within the bare phrase structure theory of the Minimalist program, which assumes operation Merge as the basic structure building device. The proposed algorithm enforces a particular timing of application of 'substitution' Merge and 'adjunction' Merge. In particular, I argue that XP adjuncts are Merged 'postcyclically' in overt sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1969

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700041289